Algebraic Stuttering Simulations
نویسندگان
چکیده
منابع مشابه
Computing Stuttering Simulations
Stuttering bisimulation is a well-known behavioural equivalence that preserves CTL-X, namely CTL without the next-time operator X. Correspondingly, the stuttering simulation preorder induces a coarser behavioural equivalence that preserves the existential fragment ECTL-{X,G}, namely ECTL without the next-time X and globally G operators. While stuttering bisimulation equivalence can be computed ...
متن کاملAlgebraic simulations
A fruitful approach to the study of state-based systems consists in their mathematical formalization by means of models like Kripke structures, which allows to study their associated properties by means of simulations to relate them to other, possibly better-known systems [5, 7, 23]. This work tries to advance two main goals along those lines: the first, to generalize the notion of simulation b...
متن کاملAlgebraic Attacks on SOBER-t32 and SOBER-t16 without Stuttering
This paper presents algebraic attacks on SOBER-t32 and SOBER-t16 without stuttering. For unstuttered SOBER-t32, two different attacks are implemented. In the first attack, we obtain multivariate equations of degree 10. Then, an algebraic attack is developed using a collection of output bits whose relation to the initial state of the LFSR can be described by low-degree equations. The resulting s...
متن کاملTheoroidal Maps as Algebraic Simulations
Computational systems are often represented by means of Kripke structures, and related using simulations. We propose rewriting logic as a flexible and executable framework in which to formally specify these mathematical models, and introduce a particular and elegant way of representing simulations in it: theoroidal maps. A categorical viewpoint is very natural in the study of these structures a...
متن کاملCompleteness of algebraic CPS simulations
The algebraic lambda calculus (λalg) and the linear algebraic lambda calculus (λlin) are two extensions of the classical lambda calculus with linear combinations of terms. They arise independently in distinct contexts: the former is a fragment of the differential lambda calculus, the latter is a candidate lambda calculus for quantum computation. They differ in the handling of application argume...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.03.077